A robust filter in stock networks analysis

We show that the use of a minimal spanning tree (MST) to filter important information in a complex system is not robust except when the system contains a unique MST. In this paper we propose to use the forest of all MSTs as a robust filter. According to this filter, centrality measures are also robust. For that purpose an algorithm, which can also be used to detect the uniqueness of an MST, will be provided. A simple hypothetical example will clarify the construction of the proposed filter and a real problem in filtering the information contained in NYSE 100 stocks will illustrate its advantages compared to the MST-based filter.     

Handling the valuation of the predicates in a fuzzy model

Given a fuzzy model, and therefore a graded valuation of the predicates, several handlings of such a valuation are possible. For example, we can change the set of truth values, modify the scale, cut the predicates, and identify truth values. In this exploratory paper we analyze some of the properties preserved under these handlings. To do this we refer to an approach to fuzzy semantics in which the valuation structures can vary freely inside a given type.     

Optical design and multi-objective optimization with fuzzy method for miniature zoom optics

In this paper a thinning L-type zoom lens design was proposed to exploit the reflecting and refracting surfaces connected by a prism. However, in the L-type designs, the modulation transfer function (MTF) value is comparatively low compared with that in its coaxial counterparts. If we increase the MTF, that would cause the relative illuminace (RI) degradation. We propose a combination of the Taguchi method and fuzzy approach to improve both the RI and MTF in L-type zoom systems. The resulting experimental values of orthogonal array L9 of the Taguchi method were used as inputs for fuzzy approach to obtain the MPCI value. The MPCI value was then analyzed by variance, revealing that the two most significant factors were (1) the surface 7 to image length and (2) the semi-aperture of the front element. In our proposed method, the appropriate weight of MTF and RI for the inputs of fuzzy controllers increased the MTF by 3.74%, but the RI only reduced by 0.13% in the systematic wide-angle end, respectively.     

Automated prover for attribute dependencies in data with grades

We present a new axiomatization of logic for dependencies in data with grades, which includes ordinal data and data over domains with similarity relations, and an efficient reasoning method that is based on the axiomatization. The logic has its ordinary-style completeness characterizing the ordinary, bivalent entailment as well as the graded-style completeness characterizing the general, possibly intermediate degrees of entailment. A core of the method is a new inference rule, called the rule of simplification, from which we derive convenient equivalences that allow us to simplify sets of dependencies while retaining semantic closure. The method makes it possible to compute a closure of a given collection of attributes with respect to a collection of dependencies, decide whether a given dependency is entailed by a given collection of dependencies, and more generally, compute the degree to which the dependency is entailed by a collection of dependencies. We also present an experimental evaluation of the presented method.     

Generalized valuations on MTL-algebras

In this paper, we study some kinds of generalized valuations on MTL-algebras, discuss the relationship between the cokernel of generalized valuations and types of filters on MTL-algebras. Then, we give some equivalent characterizations of positive implicative generalized valuations on MTL-algebras. Finally, we characterize the structure theory of quotient MTL algebras based on the congruence relation, which is constructed by generalized valuations. The results of this paper not only generalize related theories of generalized valuations, but also enrich the algebraic conclusion of probability measure, on algebras of triangular norm based fuzzy logic.     

Multifunction Optimization Problems Involving Parameters: Necessary Optimality Conditions

We prove the Fritz John and Kuhn-Tucker necessary optimality conditions for vector optimization problems involving multifunctions and parameters under relaxed assumptions.     

地下工程围岩分类模糊推理系统设计

将现场获取的影响地下工程围岩分类的几种主要因素视为判别围岩类别论域上的模糊子集,利用建立的地下工程围岩分类模糊逻辑推理系统对围岩类别进行模糊逻辑推理运算,获得与实际情况相一致的围岩类别的判定,直接为地下工程的信息化设计和施工提供依据。     

空化起始的理论预测——模糊空化系统

木文建立了一个模糊空化系统、运用模糊数学的理论对空化起始问题进行了理论预测、根据反映空化核群空化行为的四个空化特征值和由试验得出的一些定性规律,用模糊理论的方法得出控制系统空化状态的模糊状态转移矩阵,从而估算出系统的空化状态。用本文所提出的方法对两种轴对称头体的空化起始进行了预测。所得的结果与相应的试验结果相当满意地符合。     

用Level Set方法追踪运动界面

首先介绍了近年来发展起来的界面追踪技术Level Set方法,然后采用五阶WENO格式和积分平均型TVD格式计算Level Set方程,用修正的Godunov方法求解重新初始化的Level Set方程,数值求解了同心圆在常数流场,圆和矩形界面在剪切流场,缺口圆在旋转流场中的界面变形和还原效果,比较了时间导数离散精度和Level Set函数有无重新初始化对界面追踪效果的影响．最后,通过和其它界面处理方法的比较可以看出,Level Set方法不仅能够比较准确地追踪运动界面,而且无须进行复杂繁琐的界面重构技术,容易编程,具有较大的通用性．